Stochastic multi-objective optimization: a survey on non-scalarizing methods
نویسندگان
چکیده
Currently, stochastic optimization on the one hand and multi-objective optimization on the other hand are rich and well-established special fields of Operations Research. Much less developed, however, is their intersection: the analysis of decision problems involving multiple objectives and stochastically represented uncertainty simultaneously. This is amazing, since in economic and managerial applications, the features of multiple decision criteria and uncertainty are very frequently co-occurring. Part of the existing quantitative approaches to deal with problems of this class apply scalarization techniques in order to reduce a given stochastic multi-objective problem to a stochastic single-objective one. The present article gives an overview over a second strand of the recent literature, namely methods that preserve the multi-objective nature of the problem during the computational analysis. We survey publications assuming a risk-neutral decision maker, but also articles addressing the situation where the decision maker is risk-averse. In the second case, modern risk measures play a prominent role, and generalizations of stochastic orders from the univariate to the multivariate case have recently turned out as a promising methodological tool. Modeling questions as well as issues of computational solution are discussed.
منابع مشابه
Scalarizing cost-effective multi-objective optimization algorithms made possible with kriging
Purpose – The purpose of this paper is threefold: to make explicitly clear the range of efficient multi-objective optimization algorithms which are available with kriging; to demonstrate a previously uninvestigated algorithm on an electromagnetic design problem; and to identify algorithms particularly worthy of investigation in this field. Design/methodology/approach – The paper concentrates ex...
متن کاملMethods for multi-objective optimization: An analysis
Decomposition-based methods are often cited as the solution to multi-objective nonconvex optimization problems with an increased number of objectives. These methods employ a scalarizing function to reduce the multi-objective problem into a set of single objective problems, which upon solution yield a good approximation of the set of optimal solutions. This set is commonly referred to as Pareto ...
متن کاملEvolutionary Many-Objective Optimization Based on Adversarial Decomposition
The decomposition-based method has been recognized as a major approach for multiobjective optimization. It decomposes a multi-objective optimization problem into several singleobjective optimization subproblems, each of which is usually defined as a scalarizing function using a weight vector. Due to the characteristics of the contour line of a particular scalarizing function, the performance of...
متن کاملOn Continuation Methods for Non-Linear Bi-Objective Optimization: Certified Interval-Based Approach
The global optimization of constrained Non-Linear Bi-Objective Optimization problems (NLBOO) aims at covering their Pareto-optimal front which is in general a manifold in R. Continuation methods can help in this context as they can follow a continuous component of this front once an initial point on it is provided. They constitute somehow a generalization of the classical scalarizing framework ...
متن کاملGeneralized Scalarizing Model GENS in DSS WebOptim
A web-based Decision Support System WebOptim for solving multiple objective optimization problems is presented. Its basic characteristics are: user-independent, multisolver-admissibility, method-independent, heterogeneity, web-accessibility. Core system module is an original generalized interactive scalarizing method. It incorporates a number of thirteen interactive methods. Most of the known s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Annals OR
دوره 236 شماره
صفحات -
تاریخ انتشار 2016